associative search

См. также в других словарях:

• associative search — asociatyvioji paieška statusas T sritis informatika apibrėžtis Paieška, kuri atliekama pagal ieškomo žodžio semantinius ryšius su kitais žodžiais arba sąvokomis. Radinyje gali ir nebūti paieškai pateikto žodžio. atitikmenys: angl. associative… …   Enciklopedinis kompiuterijos žodynas

• Associative memory — may refer to: * a type of memory closely associated with neural networks; such as Bidirectional Associative Memory, Autoassociative memory and Hopfield net. * a type of computer memory; see Content addressable memory. * an aspect of human memory; …   Wikipedia

• Associative array — In computer science, an associative array (also called a map or a dictionary) is an abstract data type composed of a collection of (key,value) pairs, such that each possible key appears at most once in the collection. Operations associated with… …   Wikipedia

• Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… …   Wikipedia

• Holographic associative memory — is part of the family of analog, correlation based, associative, stimulus response memories, where information is mapped onto the phase orientation of complex numbers operating. It can be considered as a complex valued artificial neural network.… …   Wikipedia

• content search — asociatyvioji paieška statusas T sritis informatika apibrėžtis Paieška, kuri atliekama pagal ieškomo žodžio semantinius ryšius su kitais žodžiais arba sąvokomis. Radinyje gali ir nebūti paieškai pateikto žodžio. atitikmenys: angl. associative… …   Enciklopedinis kompiuterijos žodynas

• Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… …   Wikipedia

• Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia

• Memoria de contenido direccionable — La memoria de contenido direccionable (Content Addressable Memory, o CAM, en inglés), es un tipo de memoria de computador empleada en determinadas aplicaciones que requieren velocidades de búsqueda muy elevadas. Al contrario de las memorias… …   Wikipedia Español

• Memory disambiguation — is a set of techniques employed by high performance out of order execution microprocessors that execute memory access instructions (loads and stores) out of program order. The mechanisms for performing memory disambiguation, implemented using… …   Wikipedia

• TDS — may refer to: * (of medication) to be taken three times daily. * Total dissolved solids, the total mass content of dissolved ions and molecules or suspended microgranules in a liquid medium. * Tabular Data Stream is the name of a computer… …   Wikipedia